TSTP Solution File: SEV013^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV013^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n089.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:33:34 EDT 2014
% Result : Theorem 0.82s
% Output : Proof 0.82s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV013^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n089.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 32286.75MB
% % OS : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 07:29:11 CDT 2014
% % CPUTime : 0.82
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x1f0c710>, <kernel.Type object at 0x1f0ccf8>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) of role conjecture named cTHM511_pme
% Conjecture to prove = ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))']
% Parameter a:Type.
% Trying to prove ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))
% Found eq_ref0:=(eq_ref a):(forall (a0:a), (((eq a) a0) a0))
% Found (eq_ref a) as proof of (forall (Xx:a), (((eq a) Xx) Xx))
% Found (eq_ref a) as proof of (forall (Xx:a), (((eq a) Xx) Xx))
% Found eq_sym0:=(eq_sym a):(forall (a0:a) (b:a), ((((eq a) a0) b)->(((eq a) b) a0)))
% Found (eq_sym a) as proof of (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))
% Found (eq_sym a) as proof of (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))
% Found ((conj10 (eq_ref a)) (eq_sym a)) as proof of ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))
% Found (((conj1 (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a)) as proof of ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))
% Found ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a)) as proof of ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))
% Found ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a)) as proof of ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))
% Found eq_trans0000:=(eq_trans000 Xz):((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found (eq_trans000 Xz) as proof of ((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found ((eq_trans00 Xy) Xz) as proof of ((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found (((eq_trans0 Xx) Xy) Xz) as proof of ((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found ((((eq_trans a) Xx) Xy) Xz) as proof of ((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found ((((eq_trans a) Xx) Xy) Xz) as proof of ((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->(((eq a) Xx) Xz)))
% Found (and_rect00 ((((eq_trans a) Xx) Xy) Xz)) as proof of (((eq a) Xx) Xz)
% Found ((and_rect0 (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)) as proof of (((eq a) Xx) Xz)
% Found (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)) as proof of (((eq a) Xx) Xz)
% Found (fun (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))) as proof of (((eq a) Xx) Xz)
% Found (fun (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))) as proof of (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))
% Found (fun (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))) as proof of (forall (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))
% Found (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))) as proof of (forall (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))
% Found (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))) as proof of (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))
% Found ((conj00 ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)))) as proof of ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))
% Found (((conj0 (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)))) as proof of ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))
% Found ((((conj ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)))) as proof of ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))
% Found ((((conj ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz)))) as proof of ((and ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz))))
% Got proof ((((conj ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))))
% Time elapsed = 0.507736s
% node=61 cost=-131.000000 depth=16
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((((conj ((and (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx))))) (forall (Xx:a) (Xy:a) (Xz:a), (((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz))->(((eq a) Xx) Xz)))) ((((conj (forall (Xx:a), (((eq a) Xx) Xx))) (forall (Xx:a) (Xy:a), ((((eq a) Xx) Xy)->(((eq a) Xy) Xx)))) (eq_ref a)) (eq_sym a))) (fun (Xx:a) (Xy:a) (Xz:a) (x:((and (((eq a) Xx) Xy)) (((eq a) Xy) Xz)))=> (((fun (P:Type) (x0:((((eq a) Xx) Xy)->((((eq a) Xy) Xz)->P)))=> (((((and_rect (((eq a) Xx) Xy)) (((eq a) Xy) Xz)) P) x0) x)) (((eq a) Xx) Xz)) ((((eq_trans a) Xx) Xy) Xz))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------